package leetcode.ge100;

class Solution_344 {
	public static void main(String[] args) {
	}

	public void reverseString(char[] s) {
		int l = s.length;
		int half = l / 2;

		char tmp = 1;

		for (int i = 0; i <= half; i++) {
			tmp = s[i];
			s[i] = s[l - 1 - i];
			s[l - 1 - i] = tmp;
		}

	}

}
